Static Monotonicity Analysis for λ-Definable Functions over Lattices
نویسندگان
چکیده
We employ static analysis to examine monotonicity of functions defined over lattices in a λ-calculus augmented with constants, branching, meets, joins and recursive definitions. The need for such a verification procedure has recently arisen in our work with a static analyzer generator called Zoo, in which the specification of static analysis (input to Zoo) consists of finite-height lattice definitions and function definitions over the lattices. Once monotonicity of the functions is ascertained, the generated analyzer is guaranteed to terminate.
منابع مشابه
On equivalence relations second order definable over H(κ)
Let κ be an uncountable regular cardinal. Call an equivalence relation on functions from κ into 2 second order definable over H(κ) if there exists a second order sentence φ and a parameter P ⊆ H(κ) such that functions f and g from κ into 2 are equivalent iff the structure 〈H(κ),∈, P, f, g〉 satisfies φ. The possible numbers of equivalence classes of second order definable equivalence relations c...
متن کاملDefinable functions in the simply typed lambda-calculus
It is a common knowledge that the integer functions definable in the simply typed λ-calculus are exactly the extended polynomials. This is indeed the case when one interprets integers over the type (p → p) → p → p where p is a base type and/or equality is taken as β-conversion. It is commonly believed that the same holds for βη-equality and for integers represented over any fixed type of the fo...
متن کاملA Monotonicity Result for Hard-core and Widom–rowlinson Models on Certain D-dimensional Lattices
For each d ≥ 2, we give examples of d-dimensional periodic lattices on which the hard-core and Widom–Rowlinson models exhibit a phase transition which is monotonic, in the sense that there exists a critical value λc for the activity parameter λ, such that there is a unique Gibbs measure (resp. multiple Gibbs measures) whenever λ < λc (resp. λ > λc). This contrasts with earlier examples of such ...
متن کاملDistributive Lattices of λ-simple Semirings
In this paper, we study the decomposition of semirings with a semilattice additive reduct. For, we introduce the notion of principal left $k$-radicals $Lambda(a)={x in S | a stackrel{l}{longrightarrow^{infty}} x}$ induced by the transitive closure $stackrel{l}{longrightarrow^{infty}}$ of the relation $stackrel{l}{longrightarrow}$ which induce the equivalence relation $lambda$. Again non-transit...
متن کاملOrdered O-stable Groups
An ordered structure M is called o-λ-stable if for any subset A with |A| ≤ λ and for any cut in M there are at most λ 1-types over A which are consistent with the cut. It is proved in the paper that an ordered o-stable group is abelian. Also there were investigated definable subsets and unary functions of o-stable groups.
متن کامل